Short Introduction by Example to Coq and Formalising ZF ⊆ ZFε in Coq
نویسنده
چکیده
Proof assistants are computer programs that help mathematicians to prove theorems and to formally verify the correctness of proofs. Proof assistants are nowadays one of the more exciting areas in the intersection of mathematical logic and computer science. For example, one particularly exciting achievement is the formal verification of the proof of the four colour theorem using the proof assistant Coq.
منابع مشابه
A Novel Hybrid Approach to Analyze Cost of Quality: Balanced Scorecard and Fuzzy Logic
In this paper, a new methodology in the area of cost of quality (COQ) is proposed to determine the optimal investment allocation to all costs. The goal is to minimize costs involved in achieving a required level of quality. The contribution of this paper is fourfold: (I) considering two types of weights for each part of COQ, in which the first type is determined by the cost volume and the secon...
متن کاملFormalising Sylow's theorems in Coq
This report presents a formalisation of Sylow’s theorems done in Coq. The formalisation has been done in a couple of weeks on top of Georges Gonthier’s ssreflect [2]. There were two ideas behind formalising Sylow’s theorems. The first one was to get familiar with Georges way of doing proofs. The second one was to contribute to the collective effort to formalise a large subset of group theory in...
متن کاملFormalising LPOs and Invariants in Coq
In the setting of CRL the notions of linear process operator LPO and invariant are implemented in Coq which is a a proof development tool based on type theory As a rst experiment we have computer checked a general property of a binary search program in the new framework
متن کاملAn Efficient Coq Tactic for Deciding Kleene Algebras
We present a reflexive tactic for deciding the equational theory of Kleene algebras in the Coq proof assistant. This tactic relies on a careful implementation of efficient finite automata algorithms, so that it solves casual equations almost instantaneously. The corresponding decision procedure was proved correct and complete; correctness is established w.r.t. any model (including binary relati...
متن کاملQArith: Coq Formalisation of Lazy Rational Arithmetic
In this paper we present the Coq formalisation of the QArith library which is an implementation of rational numbers as binary sequences for both lazy and strict computation. We use the representation also known as the Stern-Brocot representation for rational numbers. This formalisation uses advanced machinery of the Coq theorem prover and applies recent developments in formalising general recur...
متن کامل